Discrete Quantum-Behaved Particle Swarm Optimization for the Multi-Unit Combinatorial Auction Winner Determination Problem
نویسندگان
چکیده
منابع مشابه
Multi-State Particle Swarm Optimization for Discrete Combinatorial Optimization Problem
The binary-based algorithms including the binary particle swarm optimization (BPSO) algorithm are proposed to solve discrete optimization problems. Many works have focused on the improvement of the binary-based algorithms. Yet, none of these works have been represented in states. In this paper, by implementing the representation of state in particle swarm optimization (PSO), a variant of PSO ca...
متن کاملUsing quantum-behaved particle swarm optimization for portfolio selection problem
One of the popular methods for optimizing combinational problems such as portfolio selection problem is swarmbased methods. In this paper, we have proposed an approach based on Quantum-Behaved Particle Swarm Optimization (QPSO) for the portfolio selection problem. The particle swarm optimization (PSO) is a well-known population-based swarm intelligence algorithm. QPSO is also proposed by combin...
متن کاملA quantum behaved particle swarm approach to multi-objective optimization
Many real-world optimization problems have multiple objectives that have to be optimized simultaneously. In multi-objective optimization problems, the major challenge is to find the set of solutions that achieve the best compromise with regard to the whole set of objectives. Although a great deal of effort has been devoted to solving multi-objective optimization problems, the problem is still o...
متن کاملImproved Quantum-Behaved Particle Swarm Optimization
To enhance the performance of quantum-behaved PSO, some improvements are proposed. First, an encoding method based on the Bloch sphere is presented. In this method, each particle carries three groups of Bloch coordinates of qubits, and these coordinates are actually the approximate solutions. The particles are updated by rotating qubits about an axis on the Bloch sphere, which can simultaneousl...
متن کاملInteger Programming for Combinatorial Auction Winner Determination
Combinatorial auctions are important as they enable bidders to place bids on combinations of items; compared to other auction mechanisms, they often increase the efficiency of the auction, while keeping risks for bidders low. However, the determination of an optimal winner combination in combinatorial auctions is a complex computational problem. In this paper we (i) compare recent algorithms fo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Applied Sciences
سال: 2010
ISSN: 1812-5654
DOI: 10.3923/jas.2010.291.297